Adaptive packet scheduling for requests delay guaranties in packet - switched computer communication network

In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-toend network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions based on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: lengths of connections following requests, packet intensities within requests, etc.). The paper is devoted to propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of network’s load and traffic characteristics. By means of computer simulation, on representative examples, it was shown, that utilization of additional knowledge about incoming traffic in the process of packet scheduling may improve QoS guaranties for serviced traffic.